|
In the mathematical fields of graph theory and combinatorial optimization, the bipartite dimension or biclique cover number of a graph ''G'' = (''V'', ''E'') is the minimum number of bicliques (that is complete bipartite subgraphs), needed to cover all edges in ''E''. A collection of bicliques covering all edges in ''G'' is called a biclique edge cover, or sometimes biclique cover. The bipartite dimension of ''G'' is often denoted by the symbol ''d''(''G''). ==Example== An example for a biclique edge cover is given in the following diagrams: Image:Bipartite-dimension-bipartite-graph.svg|A bipartite graph... Image:Bipartite-dimension-biclique-cover.svg|...and a covering with four bicliques Image:Bipartite-dimension-red-biclique.svg|the red biclique from the cover Image:Bipartite-dimension-blue-biclique.svg|the blue biclique from the cover Image:Bipartite-dimension-green-biclique.svg|the green biclique from the cover Image:Bipartite-dimension-black-biclique.svg|the black biclique from the cover 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Bipartite dimension」の詳細全文を読む スポンサード リンク
|